Data Structures and Algorithms for Raster Data Processing

نویسنده

  • Albert L. Zobrist
چکیده

The digital image raster data structure is proving to be a useful representation for geographic information from the viewpoints of both storage and processing. Several components of this trend can be identified: the development of scanners such as Landsat for remote sensing of the Earth's surface, the development of a raster representation for terrain (elevation) data, the spread of image processing technology, and increased sophistication in application areas. The raster data structure is familiar to planners as a fine grid cell system, but current emphasis is upon ultra-large or ultra-fine raster processing made possible by image processing technology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm for Centreline Extraction Using Natural Neighbour Interpolation

Data caption and conversion are two of the most costly operations of any GIS, in terms of computer time and manual work needed for spatial data acquisition. They can represent up to 80 percent of the total implementation costs. Manual digitising is a very error prone and costly operation, especially due to the lack of explicit topology in commercial GIS systems. Indeed, each map update might re...

متن کامل

An algorithm for centerline extraction using natural neighbour interpolation

Data caption and conversion are two of the most costly operations of any GIS, in terms of computer time and manual work needed for spatial data acquisition. They can represent up to 80 percent of the total implementation costs. Manual digitising is a very error prone and costly operation, especially due to the lack of explicit topology in commercial GIS systems. Indeed, each map update might re...

متن کامل

Parleda: a Library for Parallel Processing in Computational Geometry Applications

ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...

متن کامل

A hybrid structure for the storage and manipulation of very large spatial data sets

The map data input and output problem for geographic information systems is rapidly diminishing with the increasing availability of mass digitizing, direct spatial data capture and graphics hardware based on raster technology. Although a large number of efficient raster-based algorithms exist for performing a wide variety of common tasks on these data, there are a number of procedures which are...

متن کامل

Analysis of Pre-processing and Post-processing Methods and Using Data Mining to Diagnose Heart Diseases

Today, a great deal of data is generated in the medical field. Acquiring useful knowledge from this raw data requires data processing and detection of meaningful patterns and this objective can be achieved through data mining. Using data mining to diagnose and prognose heart diseases has become one of the areas of interest for researchers in recent years. In this study, the literature on the ap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008